Orthogonal Arrays, Primitive Trinomials, and Shift-Register Sequences
نویسندگان
چکیده
منابع مشابه
Feedback Shift Register Sequences
Feedback Shift Register (FSR) sequences have been successfully implemented in many communication systems for their randomness properties and ease of implementation. These include ranging and navigation systems, spread spectrum communication systems, CDMA mobile communication systems, and crypto systems such as streamciphers. This article gives a brief overview of FSR sequences, both linear and ...
متن کاملAlgebraic Shift Register Sequences
Pseudo-random sequences are essential ingredients of every modern digital communication system including cellular telephones, GPS, secure internet transactions, and satellite imagery. Each application requires pseudo-random sequences with specific statistical properties. This book describes the design, mathematical analysis, and implementation of pseudo-random sequences, particularly those gene...
متن کاملDivision of Trinomials by Pentanomials over F2 and Orthogonal Arrays
Let C f n denote the set of all subintervals of a binary shift-register sequence with length n generated by a primitive polynomial f of degree m, where m< n≤ 2m, together with the zero vector of length n. Munemasa [8] showed that if the polynomial f is a trinomial, then C f n corresponds to an orthogonal array of strength 2. His result is based on a proof that very few trinomials of degree at m...
متن کاملDivision of trinomials by pentanomials and orthogonal arrays
We consider polynomials over the binary field, F 2. A polynomial f of degree m is called primitive if k = 2 m − 1 is the smallest positive integer such that f divides x k + 1. We consider polynomials over the binary field, F 2. A polynomial f of degree m is called primitive if k = 2 m − 1 is the smallest positive integer such that f divides x k + 1.
متن کاملTwelve New Primitive Binary Trinomials
We exhibit twelve new primitive trinomials over GF(2) of record degrees 42 643 801, 43 112 609, and 74 207 281. In addition we report the first Mersenne exponent not ruled out by Swan’s theorem [10] — namely 57 885 161 — for which none primitive trinomial exists. This completes the search for the currently known Mersenne prime exponents. Primitive trinomials of degree up to 32 582 657 were repo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 1998
ISSN: 1071-5797
DOI: 10.1006/ffta.1998.0213